Sorting using non-binary comparisons
نویسندگان
چکیده
Given a set of n elements we investigate how much of the ordering can be determined by an instrument that takes k elements and returns the t 1 , t nd 2 , . . . , t th s of them. We consider this question in both an on-line sense, in which future choices can depend on previous results, and off-line where all the queries must be chosen initally before knowing any results.
منابع مشابه
0 Quantum lower bound for sorting 1
We prove that Ω(n log n) comparisons are necessary for any quantum algorithm that sorts n numbers with high success probability and uses only comparisons. If no error is allowed, at least 0.110n log2 n − 0.067n + O(1) comparisons must be made. The previous known lower bound is Ω(n).
متن کاملActive Ranking using Pairwise Comparisons
This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of n objects can be identified by standard sorting methods using n log2 n pairwise comparisons. We are interested in natural situations in which relationships among the objects may allow for ranking using far fewer pairwise comparisons. Specifically, w...
متن کاملWeak Heaps and Friends: Recent Developments
A weak heap is a variant of a binary heap where, for each node, the heap ordering is enforced only for one of its two children. In 1993, Dutton showed that this data structure yields a simple worstcase-efficient sorting algorithm. In this paper we review the refinements proposed to the basic data structure that improve the efficiency even further. Ultimately, minimum and insert operations are s...
متن کاملSorting algorithms based on the odd-even transposition sort and the shearsort with DNA strands
In recent works for high performance computing, computation with DNA molecules, that is, DNA computing, has considerable attention as one of non-silicon based computing. In this paper, we propose two procedures for sorting with DNA strands. An input of the algorithms is a set of binary numbers of bits, which are denoted by kinds of DNA strands. We first propose a procedure for the compare-and-e...
متن کاملAn Efficient Non-dominated Sorting Method for Evolutionary Algorithms
We present a new non-dominated sorting algorithm to generate the non-dominated fronts in multi-objective optimization with evolutionary algorithms, particularly the NSGA-II. The non-dominated sorting algorithm used by NSGA-II has a time complexity of O(MN(2)) in generating non-dominated fronts in one generation (iteration) for a population size N and M objective functions. Since generating non-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1507.05955 شماره
صفحات -
تاریخ انتشار 2015